A Cyclic Analogue of Stanley's Shuffling Theorem
نویسندگان
چکیده
We introduce the cyclic major index of a permutation and give bivariate analogue enumerative formula for shuffles with given descent number due to Adin, Gessel, Reiner Roichman, which can be viewed as Stanley's shuffling theorem. This gives an answer question has been posed by Domagalski, Liang, Minnich, Sagan, Schmidt Sietsema again.
منابع مشابه
A Bijective Proof of Stanley's Shuffling Theorem
For two permutations o and u on disjoint sets of integers, consider forming a permutation on the combined sets by "shuffling" o and u (i.e., a and co appear as subsequences). Stanley [10], by considering P-partitions and a g-analogue of Saalschutz's 3F2 summation, obtained the generating function for shuffles of o and u with a given number of falls (an element larger than its successor) with re...
متن کاملCard-cyclic-to-random shuffling with relabeling
The card-cyclic-to-random shuffle is the card shuffle where the n cards are labeled 1, . . . , n according to their starting positions. Then the cards are mixed by first picking card 1 from the deck and reinserting it at a uniformly random position, then repeating for card 2, then for card 3 and so on until all cards have been reinserted in this way. Then the procedure starts over again, by fir...
متن کاملA Fractional Analogue of Brooks' Theorem
Let ∆(G) be the maximum degree of a graph G. Brooks’ theorem states that the only connected graphs with chromatic number χ(G) = ∆(G) + 1 are complete graphs and odd cycles. We prove a fractional analogue of Brooks’ theorem in this paper. Namely, we classify all connected graphs G such that the fractional chromatic number χf (G) is at least ∆(G). These graphs are complete graphs, odd cycles, C 2...
متن کاملA Bipartite Analogue of Dilworth's Theorem
Let m(n) be the maximum integer such that every partially ordered set P with n elements contains two disjoint subsets A and B, each with cardinality m(n), such that either every element of A is greater than every element of B or every element of A is incomparable with every element of B. We prove that m(n) = Θ( n logn). Moreover, for fixed ǫ ∈ (0, 1) and n sufficiently large, we construct a par...
متن کاملA Complex Analogue of Toda’s Theorem
Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting is considered to be a seminal result in computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/11238